BSP-Assisted Constrained Tetrahedralization
نویسندگان
چکیده
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them together. We generate a Binary Space Partition (BSP) tree from the triangular faces of a polyhedron and use this to identify the convex subpolyhedra in the polyhedron. Each convex subpolyhedron is tetrahedralized individually. Using an original merging process, the boundaries between these subpolyhedra are joined and tetrahedralized, ensuring that no tetrahedra are created outside of the original polyhedron in this merging process.
منابع مشابه
The Strange Complexity of Constrained Delaunay Triangulation
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomial-time solution. Constrained Delaunay tetrahedralization has the unusual status (for a small-dimensional problem) of being NP-hard only for degenerate inputs.
متن کاملAn Approach for Delaunay Tetrahedralization of Bodies with Curved Boundaries
Problem of tetrahedral meshing of three-dimensional domains whose boundaries are curved surfaces is wide open. Traditional approach consists in an approximation of curved boundaries by piecewise linear boundaries before mesh generation. As the result mesh quality may deteriorate. This paper presents a technique for Delaunay-based tetrahedralization in which a set of constrained facets is formed...
متن کاملValidation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersecting polygons or open gaps to external validation rules. If this testing is not performed well, or not at all, non-valid polyhedra could be stored in geo-databases. This paper proposes the utilization of the Constrained Delaunay T...
متن کاملComparison of EPI Distortion Correction Methods in Diffusion Tensor MRI Using a Novel Framework
Diffusion weighted images (DWIs) are commonly acquired with Echo-planar imaging (EPI). B0 inhomogeneities affect EPI by producing spatially nonlinear image distortions. Several strategies have been proposed to correct EPI distortions including B0 field mapping (B0M) and image registration. In this study, an experimental framework is proposed to evaluation the performance of different EPI distor...
متن کاملOn The Robust Construction of Constrained Delaunay Tetrahedralizations
We present a simple and robust algorithm to construct the Constrained Delaunay Tetrahedralization(CDT) for a Piecewise Linear Complex(PLC). The algorithm is based on Si’s CDT [1] algorithm, but we provide a new facet recovery algorithm, which is simple and easy to implement. The implementation and robustness issues of the CDT algorithm are discussed in detail and the program which implements th...
متن کامل